Solving a Capacitated Waste Collection Problem Using an Open-Source Tool
نویسندگان
چکیده
Increasing complexity in municipal solid waste streams worldwide is pressing Solid Waste Management Systems (SWMS), which need solutions to manage the properly. collection and transport first task, traditionally carried out by countries/municipalities responsible for management. In this approach, drivers are decision-making regarding routes, leading inefficient resource expenses. sense, strategies optimize routes receiving increasing interest from authorities, companies scientific community. Works strand usually focus on route optimization big cities, but small towns could also benefit technological development improve their SWMS. related combinatorial that can be modeled as capacitated vehicle routing problem. paper, a Capacitated Collection Problem will considered evaluate performance of metaheuristic approaches city Bragança, Portugal. The algorithms used available Google OR-tools, an open-source tool with modules solving problems. Guided Local Search obtained best results optimizing planning. Furthermore, comparison real data showed application OR-Tools promising save resources collection.
منابع مشابه
Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application
The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...
متن کاملsolving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application
the urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). in fact, making slight improvements in this issue lead to a huge saving in municipal consumption. some inci...
متن کاملSolving an urban waste collection problem using ants heuristics
This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic nature of the considered problem is that of a capacitated arc routing problem, although it has several specific characteristics, mainly derived from traffic regulations. We prese...
متن کاملSolving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem
It is observed that the separated design of location for depots and routing for servicing customers often reach a suboptimal solution. So, solving location and routing problem simultaneously could achieve better results. In this paper, waste collection problem is considered with regard to economic and societal objective functions. A non-dominated sorting genetic algorithm (NSGA-II) is used to l...
متن کاملA hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center
This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-10562-3_11